Impact‐noise reduction by floor coverings
نویسندگان
چکیده
منابع مشابه
VOC- and SVOC-emissions from adhesives, floor coverings and complete floor structures.
UNLABELLED Emissions of volatile organic compounds (VOC) and semivolatile organic compounds (SVOC) from materials for flooring installation (primer, screed, adhesive, floor covering) were measured by means of emission test chambers and cells over a time period of at least 28 days at 23 degrees C, 50% relative humidity and an area specific air flow rate of q = 1.25 m(3)/m(2) h. Single components...
متن کاملRaynaud’s Group-scheme and Reduction of Coverings
1.1. Reduction of coverings of degree p. Let R be a discrete valuation ring of mixed characteristics, S = SpecR, which has generic point η with fraction field K and special point s with residue field k of characteristic p > 0. Consider a generically smooth, stable marked curve Y → S with an action of a finite group G of order divisible by p. Denote X = Y/G. We assume that G acts freely on the c...
متن کاملInformation Hiding by Coverings *
We propose a formal model for embedding information in black-white images and prove the equivalence between existence of embedding schemes and covering codes. An asymptoticly tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows to embed up to log 2 (n + 1) bits in coverwords of n bi...
متن کاملTolerances Induced by Irredundant Coverings
In this paper, we consider tolerances induced by irredundant coverings. Each tolerance R on U determines a quasiorder .R by setting x .R y if and only if R(x) ⊆ R(y). We prove that for a tolerance R induced by a covering H of U , the covering H is irredundant if and only if the quasiordered set (U,.R) is bounded by minimal elements and the tolerance R coincides with the product &R ◦.R. We also ...
متن کاملMultiple vertex coverings by cliques
For positive integers m1, . . . ,mk, let f(m1, . . . ,mk) be the minimum order of a graph whose edges can be coloured with k colours such that every vertex is in a clique of cardinality mi all of whose edges have the i th colour for all i = 1, 2, . . . , k. The value for k = 2 was determined by Entringer et al. (J. Graph Theory 24 (1997), 21–23). We show that if k is fixed then f(m, . . . ,m) =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Acoustical Society of America
سال: 1978
ISSN: 0001-4966
DOI: 10.1121/1.2004132